package com.sicheng.lc.周赛.分类.dfs记忆化;

/**
 * @author zsc
 * @version 1.0
 * @date 2022/7/14 23:29
 */
public class 被围绕的区域 {
    //https://leetcode.cn/problems/surrounded-regions/




    public static void main(String[] args) {
        被围绕的区域 s = new 被围绕的区域();
        char[][] g = {
                {'O', 'X', 'X', 'O', 'X'},
                {'X', 'O', 'O', 'X', 'O'},
                {'X', 'O', 'X', 'O', 'X'},
                {'O', 'X', 'O', 'O', 'O'},
                {'X', 'X', 'O', 'X', 'O'}};
    }
}
